GlobalAncova with Special Sum of Squares Decompositions

نویسندگان

  • Ramona Scheufele
  • Manuela Hummel
  • Reinhard Meister
  • Ulrich Mansmann
چکیده

1 Abstract This vignette shows the enhancements made for GlobalAncova. Basically, there are four ideas implemented: ˆ decomposition of the sum of squares of a linear model ([2]) ˆ a plotting function for the sequential decomposition ˆ pairwise comparison for factor levels ˆ adjustment for global covariates The decomposition of the model sum of squares results in an ANOVA table, which shows the sum of squares due to each term of a linear model. It can be used either on a global basis or for a small group of genes on a gene-wise basis. Pairwise comparisons allow conclusions about whether or not the gene expressions of two levels of a factor are significantly different. An adjustment for global covariates is possible in cases where not only one but two expression sets per subject exist. If the second set describes the subject’s ’normal’ status, it can be used to reduce the variance between subjects.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lattices of Subautomata and Direct Sum Decompositions of Automata

The subject of this paper are general properties of direct sum decompositions of automata. Using certain properties of the lattice Sub(A) of subautomata of an automaton A and its Boolean part, lattices of direct sum congruences and direct sum decompositions of A are characterized. We show that every automaton A can be represented as a direct sum of direct sum indecomposable automata, and that t...

متن کامل

An Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering

Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets.

متن کامل

Infinite-dimensional versions of the primary, cyclic and Jordan decompositions

The famous primary and cyclic decomposition theorems along with the tightly related rational and Jordan canonical forms are extended to linear spaces of infinite dimensions with counterexamples showing the scope of extensions.

متن کامل

A Scalable Optimization Approach for Fitting Canonical Tensor Decompositions

Tensor decompositions are higher-order analogues of matrix decompositions and have proven to be powerful tools for data analysis. In particular, we are interested in the canonical tensor decomposition, otherwise known as CANDECOMP/PARAFAC (CP), which expresses a tensor as the sum of component rank-one tensors and is used in a multitude of applications such as chemometrics, signal processing, ne...

متن کامل

Solving System of Linear Congruence Equations over some Rings by Decompositions of Modules

In this paper, we deal with solving systems of linear congruences over commutative CF-rings. More precisely, let R be a CF-ring (every finitely generated direct sum of cyclic R-modules has a canonical form) and let I_1,..., I_n be n ideals of R. We introduce congruence matrices theory techniques and exploit its application to solve the above system. Further, we investigate the application of co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010